نتایج جستجو برای: ACCELERATION TECHNIQUES
تعداد نتایج: 672074 فیلتر نتایج به سال:
in this paper, chebyshev acceleration technique is used to solve the fuzzy linear system (fls). this method is discussed in details and followed by summary of some other acceleration techniques. moreover, we show that in some situations that the methods such as jacobi, gauss-sidel, sor and conjugate gradient is divergent, our proposed method is applicable and the acquired results are illustrate...
The efficiency with which an integer may be factored into its prime factors determines several public key cryptosystems’ security in use today. Although there is a quantum-based technique polynomial time for factoring, on traditional computer, no algorithm. We investigate how to enhance the wheel factoring this paper. Current factorization algorithms rely very restricted set of integers as base...
the work addressed in this paper is a comparative study between convergence of the acceleration techniques, diagonal pad'{e} approximants and shanks transforms, on homotopy analysis method and adomian decomposition method for solving differential equations of integer and fractional orders.
In this paper, Chebyshev acceleration technique is used to solve the fuzzy linear system (FLS). This method is discussed in details and followed by summary of some other acceleration techniques. Moreover, we show that in some situations that the methods such as Jacobi, Gauss-Sidel, SOR and conjugate gradient is divergent, our proposed method is applicable and the acquired results are illustrate...
The work addressed in this paper is a comparative study between convergence of the acceleration techniques, diagonal pad'{e} approximants and shanks transforms, on Homotopy analysis method and Adomian decomposition method for solving differential equations of integer and fractional orders.
ABSTRACT: A busy beaver is a Turing machine of N states which, given a blank tape, halts with an equal or higher number of printed symbols than all other machines of N states. Candidates for this class of Turing machine cannot realistically be run on a traditional simulator due to their high demands on memory and time. This paper describes some techniques that can be used to run these machines ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید